Segment-based encoding system using exposed area filling performed by an encoder and a decoder

ABSTRACT

An encoding system encodes and decodes video data using an exposed area fill processor. A nonkey frame is encoded as a set of kinetic information relating segments of a reference frame to the nonkey frame and the nonkey frame is decoded from segments of at least one reference frame, the kinetic information and results of an exposed area fill process that estimates contents of the nonkey frame not already covered by the segments and the kinetic information. The exposed area fill results can be determined at the encoder and conveyed to the decoder or the decoder can determine the results independently. The encoded video data can include an indication of which of a plurality of fill schemes are used, or the decoder can determine the indication by itself. The exposed area fill information might include bounds of areas to be filled and/or pixel values of pixels therein.

CROSS-REFERENCES TO RELATED APPLICATIONS

[0001] This application is a continuation-in-part of U.S. applicationSer. No. 09/550,705, filed on Apr. 17, 2000, the complete disclosure ofwhich is incorporated herein by reference for all purposes.

FIELD OF THE INVENTION

[0002] The present invention relates generally to the compression ofvideo data, and more particularly to a synchronized encoder/decodersystem wherein the decoder performs a segmentation that is performed bythe encoder for encoding video data so that the encoder need not conveyto the decoder the entire results of the encoder's segmentation.

BACKGROUND OF THE INVENTION

[0003] 1. Brief Introduction

[0004] As more communication requires video, such as real-time streamingof video, video conferencing, digital television, interactive televisionand Internet-based communications such as hypertext transport of WorldWide Web (WWW) content, more efficient ways of utilizing existingbandwidth are needed. This is because the typical bandwidth allocated toa particular transmission mode (e.g., broadcast, cable, telephone lines,etc.) is much less than the bandwidth typically required for a videostream. Thus, if such modes are to carry video, compression is needed.Compression is also needed where the video is stored, so that storagecapacity is efficiently used. The advent of multi-media capabilities onmost computer systems has taxed traditional storage devices, such ashard drives, to their limits.

[0005] Compression allows digitized video sequences to be representedefficiently, allowing more video to be transmitted in a given amount oftime over a given channel, or more video to be stored in a given storagemedium. Compression does this by reducing the bitstream, or videoinformation flow, of the video sequences at a transmitter (which can beplacing the bitstream into a channel or storing into a storage medium)while retaining enough information that a decoder or receiver at theother end of the channel or reading the storage medium can reconstructthe video in a manner adequate for the specific application, such astelevision, videoconferencing, etc.

[0006] Video is typically represented by a sequence of images, called“frames” or “video frames” that, when played in sequence, present thevideo. As used herein, a video stream might refer to a video and audiostream, where the audio is included with the video. However, forsimplicity, just the video compression is often described.

[0007] As the terms are used herein, an image is data derived from amulti-dimensional signal. The signal might be originated or generatedeither naturally or artificially. This multi-dimensional signal (wherethe dimension could be one, two, three, or more) may be represented asan array of pixel color values such that pixels placed in an array andcolored according to each pixel's color value would represent the image.Each pixel has a location and can be thought of as being a point at thatlocation or as a shape that fills the area around the pixel such thatany point within the image is considered to be “in” a pixel's area orconsidered to be part of the pixel. The image itself might be amultidimensional pixel array on a display, on a printed page, an arraystored in memory, or a data signal being transmitted and representingthe image. The multidimensional pixel array can be a two-dimensionalarray for a two-dimensional image, a three-dimensional array for athree-dimensional image, or some other number of dimensions.

[0008] The image can be an image of a physical space or plane or animage of a simulated and/or computer-generated space or plane. In thecomputer graphic arts, a common image is a two-dimensional view of acomputer-generated three-dimensional space (such as a geometric model ofobjects and light sources in a three-space). An image can be a singleimage or one of a plurality of images that, when arranged in a suitabletime order, form a moving image, herein referred to as a video sequence.

[0009] Pixel color values can be selected from any number of pixel colorspaces. One color space in common use is known as the YUV color space,wherein a pixel color value is described by the triple (Y, U, V), wherethe Y component refers to a grayscale intensity or luminance, and U andV refer to two chrominance components. The YUV color space is commonlyseen in television applications. Another common color space is referredto as the RGB color space, wherein R, G and B refer to the Red, Greenand Blue color components, respectively. The RGB color space is commonlyseen in computer graphics representations, along with CYMB (cyan,yellow, magenta, and black) often used with computer printers.

[0010] Video compression is possible because an uncompressed videosequence contains redundancies and some of the video signal can bediscarded without greatly affecting the resulting video. For example,each frame of a video sequence representing a stationary scene would benearly identical to other frames in the video sequence. Most videocompression routines attempt to remove the superfluous information sothat the related image frames can be represented in terms of previousimage frame(s), thus eliminating the need to transmit an entire imagefor each video frame. Alternatively, routines like motion JPEG, codeeach video frame separately and ignore temporal redundancy.

[0011] 2. Known Compression Techniques

[0012] There have been numerous attempts at adequately compressing videoimagery. These methods generally fall into the following twocategories: 1) spatial redundancy reduction, and 2) temporal redundancyreduction.

[0013] 2.1. Spatial Redundancy Reduction

[0014] Spatial redundancy reduction takes advantage of the correlationamong neighboring pixels in order to derive a more efficientrepresentation of the important information in an image frame. Thesemethods are more appropriately termed still-image compression routines,as they generally address each frame in isolation, i.e., independent ofother frames in the sequence. Because of this, they do not attempt totemporal, or frame-to-frame, redundancy. Common still-image compressionschemes include JPEG, wavelets, and fractals.

[0015] 2.1.1. JPEG/DCT Based Image Compression

[0016] One of the first commonly used methods of still-image compressionwas the direct cosine transformation (“DCT”) compression system, whichis at the heart of JPEG. DCT operates by representing each digital imageframe as a series of cosine waves or frequencies and quantizingcoefficients of the cosine series. The higher frequency coefficients arequantized more harshly than those of the lower frequencies. The resultof the quantization is a large number of zero coefficients, which can beencoded very efficiently. However, JPEG and similar compression schemesdo not address the crucial issue of temporal redundancy.

[0017] 2.1.2. Wavelets

[0018] As a slight improvement to the DCT compression scheme, thewavelet transformation compression scheme was devised. This system issimilar to the DCT, differing mainly in that an image frame isrepresented as a series of wavelets, or windowed oscillations, insteadof as a series of cosine waves.

[0019] 2.1.3. Fractals

[0020] Another technique is known as fractal compression. The goal offractal compression is to take an image and determine a single function,or a set of functions, which fully describe(s) the image frame. Afractal is an object that is self-similar at different scales orresolutions, i.e., no matter what resolution one looks at, the objectremains the same. In theory, where fractals allow simple equations todescribe complex images, very high compression ratios should beachievable.

[0021] Unfortunately, fractal compression is not a viable method ofgeneral compression. The high compression ratios are only achievable forspecially constructed images, and only with considerable help from aperson guiding the compression process. In addition, fractal compressionis very computationally intensive.

[0022] 2.2. Temporal and Spatial Redundancy Reduction

[0023] Adequate motion video compression requires reduction of bothtemporal and spatial redundancies. Temporal redundancy can be reduced byreplacing all or part of the bits representing the image of a frame withone or more references to other frames or portions of a frame. Thisallows a small number of bits to represent a larger number of bits.Block matching is the basis for most currently used effective means oftemporal redundancy removal.

[0024] In block matching, an image frame is subdivided into uniform sizeblocks (more generally, into polygons), and each block is tracked fromone frame to another and represented by a motion vector, instead ofhaving the block re-coded and placed into the bitstream for a secondtime. Examples of compression routines that use block matching includeMPEG and variants thereof

[0025] MPEG encodes the first frame in a sequence of related frames inits entirety as a so-called intra-frame, or I-frame. An I-frame is atype of key frame, meaning an image frame that is completelyself-contained and not described in relation to any other image frame.To create an I-frame, MPEG performs a still-image compression on theframe, including dividing the frame into 16 pixel by 16 pixel squareblocks. Other (so-called “predicted”) frames are encoded with respect tothe I-frame by predicting corresponding blocks of the other frame inrelation to that of the I-frame. That is, MPEG attempts to find eachblock of an I-frame within the other frame. For each block that stillexists in the other frame, MPEG transmits the motion vector, ormovement, of the block along with block identifying information.However, as a block moves from frame to frame, it may change slightly.The difference relative to the I-frame is known as residue.Additionally, as blocks move, previously hidden areas may become visiblefor the first time. These previously hidden areas are also known asresidue. That is, the collective remaining information after the blockmotion is sent is known as the residue, which is coded using JPEG andincluded in the bitstream to complete the image frame.

[0026] Subsequent frames are predicted with respect to either the blocksof the I-frame or a preceding predicted frame. In addition, theprediction can be bi-directional, i.e., with reference to both precedingand subsequent I-frames or predicted frames. The prediction processcontinues until a new key frame is inserted, at which point a newI-frame is encoded and the process repeats itself.

[0027] Although state of the art, block matching is highly inefficientand fails to take advantage of the known general physicalcharacteristics or other information inherent in the images. The blockmethod is both arbitrary and crude, as the blocks do not have anyrelationship with real objects in the image. A given block may comprisea part of an object, a whole object, or even multiple dissimilar objectswith unrelated motion. In addition, neighboring objects will often havesimilar motion. However, since blocks do not correspond to real objects,block-based systems cannot use this information to further reduce thebitstream.

[0028] Yet another major limitation of block-based matches arisesbecause the residue created by block-based matching is generally noisyand patchy. Thus, block-based residues do not lend themselves to goodcompression via standard image compression schemes such as DCT,wavelets, or fractals.

[0029] 2.3. Alternatives

[0030] It is well recognized that the state of the art needsimprovement, specifically in that the block-based method is extremelyinefficient and does not produce an optimally compressed bitstream formotion video information. To that end, the very latest compressionschemes, such as MPEG4, allow for the inclusion of limited structuralinformation, if available, of selected items within the frames ratherthan merely using arbitrary-sized blocks. While some compression gainsare achieved, the associated overhead information is substantiallyincreased because, in addition to the motion and residue information,these schemes require that structural or shape information for eachobject in a frame must also be sent to the receiver.

[0031] Additionally, as mentioned above, the current compression methodstreat the residue as just another image frame to be compressed by JPEGusing a fixed compression.

BRIEF SUMMARY OF THE INVENTION

[0032] An encoding system encodes and decodes video data using anexposed area fill processor. The video data comprises a sequence of aplurality of image frames comprising key frames and nonkey frames, wherethe nonkey frames are encoded with reference to reference frames. Anonkey frame is encoded as a set of kinetic information relatingsegments of a reference frame to the nonkey frame and the nonkey frameis decoded from segments of the reference frame (or more than onereference frame), the kinetic information and results of an exposed areafill process that estimates contents of the nonkey frame not alreadycovered by the segments and the kinetic information. The results of theexposed area fill process can be determined at the encoder and conveyed,in whole or part, in the encoded video data, or the decoder candetermine independently the results of the exposed area fill process, asit depends only on frame content that is already available to thedecoder. If more than one fill scheme could be used, the encoded videodata can include an indication of which is used, or the decoder andencoder can determine the indication independently and in parallel. Theexposed area fill information might include bounds of areas to be filledand/or pixel values of pixels in areas to be filled.

BRIEF DESCRIPTION OF THE DRAWINGS

[0033]FIG. 1 is a block diagram of a video stream processing system;FIG. 1(a) illustrates an example where video is compressed fortransmission over a channel; FIG. 1(b) illustrates an example wherevideo is compressed for storage.

[0034]FIG. 2 is a block diagram of an encoder according to embodimentsof the present invention.

[0035]FIG. 3 is a diagram illustrating structure of a video streamaccording to embodiments of the present invention.

[0036]FIG. 4 is a diagram illustrating another variation of structure ofa video stream.

[0037]FIG. 5 is a block diagram of a decoder according to embodiments ofthe present invention.

[0038]FIG. 6 is a block diagram of a portion of an encoder, such as theencoder of FIG. 2, including a modeller.

[0039]FIG. 7 is an illustration of exposed areas.

[0040]FIG. 8 is a flowchart of an encoding process.

[0041]FIG. 9 is a flowchart of a decoding process.

DETAILED DESCRIPTION OF THE INVENTION

[0042]FIG. 1 is a block diagram of a video stream processing system 10.System 10 accepts video data from any number of sources, encodes itusing encoder 100 such that the video data is compressed (i.e., occupiesfewer bits than the uncompressed video data) for transport or storage.System 10 includes a decoder 200 that receives the transported or storedcompressed video data and decompresses for use by any number of videosinks (users).

[0043] Merely by way of example, possible video sources include a videocamera, a video storage system (typically storing uncompressed, orpartially compressed, video data), a high-speed channel, such as a cablelink or broadcast link capable of transmitting uncompressed or partiallycompressed video data, or a video player, such as a VCR or DVD player.Possible video users, for example, might include a display device, suchas a monitor or television, a video processor or video storage that canstore decoded video data.

[0044]FIG. 1(a) illustrates an example where video is compressed fortransmission over a channel 120. Channel 120, for example, could be adigital subscriber line (DSL), a cable modem, a dialup connection,broadcast, cable broadcast, satellite transmission, or the like. In suchcases, the video is compressed so that it can be transmitted usingavailable bandwidth efficiently

[0045]FIG. 1(b) illustrates an example of a system 20 where video iscompressed for storage. As shown, encoder 100 encodes video data forstorage in compressed video storage 130 for later retrieval by decoder200. Storage 130 might be, for example, a hard drive, a memory card, apersonal video recorder (PVR), RAM, CD, DVD, or any other suitablestorage.

[0046] Note that the same encoder and decoder can be used for atransmission system as used for a storage system. Of course, theencoders and decoders could be different. The differences could beexternal, such as changing the output of the encoder to point to astorage device rather than a channel, but the changes could also beinternal, such as changing the methods used by the encoder depending onwhether or not the encoder's output is time critical. For example, if itis known a priori that the encoded video will not be read from storageright away, the encoder could trade off speed for improved compression.

[0047] In a basic operation, video data, usually uncompressed videodata, is provided to encoder 100, which encodes the video data to formcompressed video data that occupies fewer bits than the uncompressedvideo data, and preferably much fewer bits, and makes the uncompressedvideo data available to the decoder (via a channel, storage, or acombination thereof). The decoder in turn decompresses the compressedvideo data to arrive at an exactor approximate copy of the uncompressedvideo data provided to the input of the encoder.

[0048]FIG. 2 is a block diagram of encoder 100 according to embodimentsof the present invention. As shown there, encoder 100 comprises a frameloader 202, a frame compressor 204, a motion matcher 206, a residuegenerator 208, an output scheduler 210 and a segmenter 220. Also shownare storage for data being processed, such as a frame buffer 230 forholding all or part of a current frame, frame buffer 232 for holding allor part of a reference frame, segment data set storage 234, kineticinformation storage 236 for storing motion factors and other kineticinformation, and residue data storage 238. Also shown, and explainedbelow are a frame decompressor 240 and a frame regenerator 242.

[0049] Frame loader 202 is configured to receive uncompressed video inand provide the uncompressed video in a frame-by-frame manner to framebuffer 230. It should be understood that the video in could be partiallycompressed and could be in any of the variety of formats. As shown,frame buffer 230 is coupled to frame processor 204, motion matcher 206,and residue generator 208 to provide all or part of the informationembodied in the current frame stored in frame buffer 230.

[0050] As used herein, the term “current frame” refers to a frame ofvideo being processed by the encoder. In a typical operation, a frame isloaded into frame buffer 230 and becomes the current frame, that currentframe is processed and another frame is loaded into frame buffer 230 andthat frame would then be the current frame. The other frame buffer,frame buffer 232, is coupled to motion matcher 206 and residue generator208 to provide all of part of the information content of the referenceframe. Frame buffer 232 is also coupled to a segmenter 220, which is interm coupled to storage 234, thereby allowing segmenter 220 to generateand store a segment data set associated with the reference frame.Storage 234 is coupled to motion matcher 206 to allow motion matcher 206to obtain all or part of a segment data set.

[0051] Residue generator 208 is coupled to frame buffers 230 and 232, aswell as kinetic information storage 236 such that residue generator 208can use information stored therein to generate residue data stored inresidue storage 238.

[0052] As used herein, the term “reference frame” refers to a framewhose information content is used, at least in part, in the encoding ofthe current frame. In the general case, the current frame might beencoded with reference to more than one reference frame, but for clarityencoder 100 in its operation is described here where only one referenceframe is needed. As used herein, the term “key frame” refers to a framethat is encoded such that it can be decoded without reference to otherframes. Note that reference frames are not required to be key frames butcan be frames that are encoded with reference to yet other referenceframes.

[0053] An operation of encoding frames will now be described beginningwith the encoder in an initial state. Initially, frame buffer 230 andframe buffer 232 are empty. Frame loader 202 loads frame buffer 230 witha frame of the input video. Since there is no reference frame at thispoint, that frame in frame buffer 230 would naturally be encoded as akey frame. However, it should be understood, that in some variations, areference frame might be preloaded, in which case the first frameprocessed does not need to be the key frame.

[0054] Continuing the description of the operation, frame compressor 204obtains the frame from frame buffer 230 and compresses it into anencoded frame. Such a compression could be lossy or lossless (which,technically, is just a special case of lossy compression). That encodedframe is then provided to output scheduler 210 to form the output videosequence. The encoded frame is also provided to a frame decompressor 240that decompresses the frame and provides it to frame regenerator 242.The output of frame regenerator 242 is stored in frame buffer 232 as thereference frame to be used for subsequent encoding steps. Of course, ifthe output of frame compressor 204 is known to be a losslesscompression, such that the outputted frame decompressor 240 can be anexact replica of the current frame, then frame decompressor and frameregenerator 242 can be eliminated and instead the contents of frame 230could simply be copied into frame buffer 232 once the current frame isencoded. Either way, once the current frame has been processed, frameloader 202 can load another frame into frame buffer 230 and that framewould become the current frame to be encoded. At this point, a referenceframe is available in frame buffer 232 and a process of encoding thecurrent frame while taking reference to the reference frame will now bedescribed.

[0055] Where the current frame is encoded with reference to thereference frame, the use of frame compressor 204 is not required.Instead, motion matcher 206 can operate on the current frame, thereference frame, and segment data about the reference frame generated bysegmenter 220, to output from motion matcher 206 kinetic information,which are stored in kinetic information storage 236. The operation ofmotion matcher 206 is described in more detail below. The kineticinformation output by motion matcher 206 relates to changes in segmentsfrom the reference frame to the current frame. In other words, thereference frame is segmented such that areas of the reference frame areassociated with segment identifiers, thus resulting in segments havingsegment boundaries bounding pixels of the reference frame. Thesesegments can be matched to pixels in the current frame and kineticinformation about the segments can be identified. Merely one example ofinformation about a segment might be a determination that a particularsegment of the reference frame is suitably represented by a similarcollection of pixels in the current frame, possibly offset in locationand/or color values. Once as many segments to be matched are matchedfrom the reference frame to pixels in the current frame, the kineticinformation associated with the current frame can be provided to outputscheduler 210 to form part or all of the encoding of the current frame,as well as being provided to residue generator 208.

[0056] Residue generator 208 can then, from the kinetic information, thecurrent frame, and the reference frame, determine what differences wouldremain between the current frame and the reference frame after thekinetic information is applied to the segments of the reference frame.Such a residue might include changes in position, shape, or color valueof pixels associated with a segment that are not already accounted forin the kinetic information. Residue might also include exposed area. Anexposed area would occur, for example, where the segments representobjects in a scene and those objects are moving between the referenceframe and the current frame. If that were the case, there would be somepixels in the current frame that are not associated with any segment ofthe reference frame because the objects or portions of objectsrepresented by those pixels of the current frame were objects orportions of objects obscured by other objects in the reference frame.This is illustrated by FIG. 7, which shows exposed areas 704 resultingfrom the frame-to-frame motion of segments 702. Thus, the pixel valuesfor exposed areas, and other residues might form the residue data outputfrom residue generator 208 to storage 238.

[0057] Residue data 238 is provided to output scheduler 210 to formanother part of the encoding of the current frame. As should be apparentfrom this description, if the residue data is an exact representation ofthe difference between the reference frame and the current frame afterthe kinetic information is applied to the reference frame, then theoutput of output scheduler 210 contains enough information such that thecurrent frame could be exactly reconstructed from nothing more thanprior knowledge of the exact contents of the reference frame, thekinetic information relating the reference frame and the current frameand the resulting residue data. However, in some cases exact replicationof the current frame is not always required, in which case residue data238 might be not the exact difference. If that is the case, then frameregenerator 242 is preferably used to regenerate the current frame fromthe reference frame, the kinetic information, and the residue data, sothat the reference frame used for subsequent encoding is not the exactreference frame, but the reference frame as it is known to berecoverable at the decoder.

[0058] Encoder 100 can repeat a process with subsequent frames becomingthe current frame, until the video is completely encoded. Although anencoder might always have a reference frame available, the encoder couldchoose to ignore the reference frame and encode the current frame as akey frame. This might happen, for example, as the result of an externaltrigger, upon detection of a scene change, or after the encoder hasdetermined that the residue data is such that encoding the current framewith the key frame would be more efficient. In instances where framesare not always losslessly compressed, the encoder might decide not touse the reference frame if it determines that sufficient losses haveaccumulated in the process of encoding frames and using those frames asreferences for subsequent encodings of frames that are used forreferences, etc.

[0059]FIG. 3 is a diagram illustrating the structure of a compressedvideo stream, as might be output by the encoder shown in FIG. 2. Asillustrated there, a frame K, followed by several non-key frames, suchas frame K+1 and K+2. As illustrated, frames K+1 and K+2 can be fullyrepresented by kinetic data, model data (explained in further detailbelow with reference to FIG. 6) and residue data. The kinetic data isshown, by way of example, is further detailed as comprising dataelements associated with segments of the current frame's referenceframe. In this example, the reference frame for frame K+1 might be frameK.

[0060] As an example of the kinetic information associated with eachsegment, the data elements there shown include translation data, z-orderdata, affine data, non-linear data, lighting data, and other data. Theencoded video data stream might also include, either in a headerapplicable to all frames, or on a frame-by-frame basis, an indication ofwhich of a plurality of segmentations schemes was used, partialsegmentation information or segmentation hints and/or partial canonicalinformation about how the segments are ordered or labelled with indexvalues. Typically, canonical information is not needed in the compressedvideo as the decoder should normally be able to order segments in thesame way as the encoder did. The encoded video data stream might havesome of the kinetic information associated with segments in asegmentation omitted if it can be predicted by the decoder.

[0061] The encoding of difference between rough frame and raw frame canbe a novel residue frame as described herein or just a simple differenceframe conventionally compressed. The residue frame can be encoded as aframe or might be encoded as segment-by-segment residue.

[0062]FIG. 4 illustrates additional data constructs that might bepresent in the compressed video information. The additional informationshown there includes a field for indicating the segmentation scheme usedfor the current frame, partial segmentation information and/or hintsabout segmentation usable by a decoder, canonicalization informationindicating an ordering of the segments and other hints that mightpossibly be present.

[0063] One canonicalization approach is to assign segment indices tosegments based on position in the frame. For example, the segment thatincludes the pixel in the upper left corner of the frame could besegment 1, the segment containing the next leftmost pixel in the top rowthat does not belong to segment 1 could be segment 2, and so on throughall the rows of pixels. If this approach is used, the encoder anddecoder can independently determine the same canonicalization as theysegment their own copies of a reference frame.

[0064]FIG. 5 is a block diagram of a decoder according to embodiments ofthe present invention. As shown there, a decoder includes an inputscheduler 502, a frame decompressor 504, a segmenter 506, a currentframe reconstructor 508 and a processor 510. Input scheduler 502receives compressed video information, from a channel, from storage orfrom another source. For key frames, the video data can be provided toframe decompressor 504 for decoding. Frame decompressor 504 can thendecode the frame and store it in a frame buffer 520. For nonkey frames,the video data can be provided to kinetic information storage 522 andresidue storage 524. Other storage shown includes segment datasetstorage 526 and approximation frame storage 528.

[0065] In operation, when a key frame is received, input scheduler 502provides it to frame decompressor 504, which decompresses the key frame,stores it in frame buffer 320 and that uncompressed frame can be output,for the use of the video user coupled to the decoder. When a nonkeyframe is received, other elements of the decoder process the frame. Insome embodiments, the decoder might determine that the next frame is akey frame by examining a flag in the compressed video data associatedwith the frame.

[0066] Once a frame is decoded and output, it can be the referenceframe, stored in frame buffer 520. The decoder includes a segmenter 506that can segment the frame in frame buffer 520 into a set of segments.The segmentation results are stored in as a segment dataset in storage526. There are many ways to structure the results. One such method is toidentify each segment with an index and a segment boundary, which is aclosed shape that encloses one or more pixels of the reference frame(although degenerate, zero-pixel segments should not be ruled out).Another method is to associate each pixel in the reference frame with asegment index. However it is stored, it should be noted that the decodercan generate the segment dataset, at least approximately, withoutrequiring any additional data from the encoder, which might increase thesize of the compressed video data. Thus, the decoder doing its ownsegmentation allows for greater compression than if the decoder reliedon the encoder's segmentation results.

[0067] When a nonkey frame is processed, the reference frame for thatnonkey frame is present in frame buffer 520. As explained above, anonkey frame might have been encoded with reference to more than onereference frame, but for clarity, this explanation relates to the casewhere only one reference frame is needed for decoding a nonkey frame. Itshould be noted that the reference frame need not be the frameimmediately prior to the nonkey frame in the video sequence and need noteven be prior to the nonkey frame being decoded.

[0068] As illustrated in FIG. 3, a nonkey frame is encoded by kineticdata, residue data and possibly other data. In the decoder shown in FIG.5, the kinetic data for the nonkey frame is supplied to kinetic datastorage 522 and the residue data for the nonkey frame is supplied toresidue storage 524. The current frame reconstructor is coupled toreceive all or part of the reference frame information from frame buffer520, all or part of the segment dataset for that reference frame, andall or part of the kinetic information for the current frame. Thecurrent frame reconstructor is configured to generate a rough frame,stored in storage 528, from that information.

[0069] The rough frame is an approximation, although it might be exact,of the current frame from the reference frame, its segmentation andkinetic information relating the segments of the reference frame to thecurrent frame. Note that the segmentation information was not requiredto be included in the overhead of the compressed video, but insteadcould have been generated entirely by the decoder. In some embodiments,decoder effort might be more of a concern than efficient bandwidthusage, in which case the encoder might include in the compressed videosome partial segmentation information or hints to assist the decoder ingenerating its own segment dataset.

[0070] Processor 510 is configured to accept the rough frame and residueinformation to form a regenerated current frame, which can then beoutput by the decoder. The regenerated current frame might then be usedas a reference frame for later received (but not necessarily later inthe video sequence) frames.

[0071] Each of the components shown in FIG. 5 might be implemented inspecial purpose hardware, programmable hardware or software. Forexample, each of components 502, 504, 506, 508 and 510 might be portionsof one program operating in an input data stream. Each of the storageelements 520, 522, 524, 526 and 528 might be separate storage areas, ormight be separate portions of a common storage or memory. In some cases,where it is more efficient, the frame buffers might change roles ratherthan having the data from one frame buffer copied to another framebuffer.

[0072] Generally, the operations of the components of the decoderperform the inverse of the operation performed by the encoder. Forexample, where the residue data is simply the a compressed differenceframe of the difference between a rough frame and the current frame,processor 510 might simply read the residue data for the current frame,decompress it and add it back to the rough frame to result in areconstruction of the current frame.

[0073] Further compression might be possible by special coding of thekinetic information as well as modelling the rough residue representingthe difference between the rough frame described above and the currentframe. For example, without further processing, the rough residue mightcontain data about exposed areas. A frame is an image of a real orgenerated scene and typically contains objects. In some segmentationschemes, segment boundaries follow boundaries of objects in the scene.If relative motion of an object is present between a current frame and areference frame, there will likely be a portion of the current framethat represents an object or background that does not correspond to asegment in the reference frame because that object or background wasobscured by another object in the reference frame but not in the currentframe. That area is referred to herein as an “exposed area.” An exampleof exposed areas is illustrated in FIG. 7.

[0074]FIG. 6 is a block diagram of a portion of a decoder that modelsthe rough residue to form model data and a remaining residue that ishopefully more compressible than the rough residue. As shown in thatfigure, the kinetic information is provided to a modeller 602 that alsohas access to the current frame, the reference frame and the segmentdataset of the reference frame. Modeller 602 generates model data 606that is output as part of the compressed data stream (see FIG. 3, for anexample of placement) and is provided to a residue generator that wouldgenerate the remaining residue.

[0075] To further compress the compressed data stream, a motion vectorcoder 604 codes the motion vectors (and possibly other kineticinformation) to reduce redundancy in the motion vectors, prior to theinformation being included in the output video data.

[0076] Referring now to FIG. 8, a flowchart of an encoding process isthere shown. The process begins with receiving a key frame (step SI) andcompressing the key frame to form an encoded key frame that is output asthe output of the encoder (S2). The compression can be lossy or lossless(as used herein, lossy compression can include zero loss (lossless)compression). If the compression results in loss of information (S3),the encoded key frame is decompressed to form a reconstructed key frameto be used in subsequent steps in place of the key frame. This allowsthe decoder to follow along with the encoder's coding process withoutthe encoder having to convey all of its state, because the encoder willoperate on what the decoder has, not what the encoder has (although inthe lossless case, those will be the same.

[0077] At step S5, the frame is now considered a reference frame and asegmentation is generated (S5). Segmentation can be done using knownmethods. Some approaches to segmentation are shown in U.S. Pat. No.______ (U.S. patent application No. 09/591,438 filed Jun. 9, 2000 andentitled “Method and Apparatus for Digital Image Segmentation”), whichis commonly owned with the present application and is incorporatedherein for all purposes. In some cases, an encoder might select among aplurality of segmentation schemes, so the encoder selects a scheme. Ifthe scheme is determinable from information that the encoder knows thedecoder has, such as the content of prior processed frames, the encoderneed not include an indication of the scheme selection in the outputvideo data. The scheme selected might depend on the image content, assome schemes might work better than others for a given image.

[0078] At step S6, the encoder receives a second frame that becomes thecurrent frame. Here we assume that the second frame is not a key frame.If it were, the process would loop back to step SI. If a key framefollowing a key frame is detected early enough, the segmentation of thefirst key frame might be omitted if it would not get used as a referencefor any nonkey frames. Note that the first frame and second frame neednot be consecutive and the first frame need not precede the second framein a video sequence.

[0079] Since we assume that the current frame is a nonkey frame, it isprocessed as such. First, segments of the reference frame (the key framedescribed above or a nonkey frame from a prior loop) are matched to thepixels of the current frame (S7) to form a segment mapping. The currentframe need not be segmented at this point—the mapping is from segmentsof the reference frame to pixels of the current frame. The process ofmotion matching might be performed in one or more methods described inU.S. Pat. No. ______ (U.S. patent application No. 09/912,743 filed Jul.23, 2001 and entitled “Motion Matching Method”), which is commonly ownedwith the present application and is incorporated herein for allpurposes.

[0080] Next, kinetic information for the segments of the segmentation isgenerated (S8). The kinetic information for a segment can be simply amotion vector representing an (X, Y) translation of a segment betweenthe reference frame and the current frame, but might include moreinformation. For example, the kinetic information for a segment mightindicate other information about the segment between the reference frameto the raw second frame, where the changes might include an indicationof a z-order of the segment (relative or absolute; determinable byexamining changes in the segment from frame to frame), deformation(rotation, dilation, other affine transformation or a nonlineartransformation defined by a set of deformation parameters), lightingchanges (an additive offset in one, two or three color planes, such asan additive offset in a luminance plane and/or a multiplicative offsetin one, two or three color planes), and/or residue by segment, or pixelcolor value offset (linear or nonlinear), such as a color offset for thesegment and a multiplicative offset for segment. While z-ordering mightbe considered an characteristic of a specific image rather than anindication of the changes in a segment from one frame to the next, here“z-ordering” refers to Bordering as determined by examining the changesof two segments relative to each other from one frame to the next.

[0081] Once the kinetic information is generated, a rough frame can begenerated (S9). A rough frame is the frame that would result by applyingthe segments of the reference frame generated in step S5 and the kineticinformation generated in step S8 to the reference frame. The roughframe, or the difference between the rough frame and the current frame,can be further processed to determine model data, as might result fromexposed area processing and applying non-motion related kineticinformation. In some embodiments, the model data is not generated orused.

[0082] Whether model data is used or not, the remaining differencebetween the rough frame and the current frame is generally referred toherein as the residue. A residue frame is generated (S11), if notalready available, from the current frame by subtracting out the imageportions or pixel values represented by the kinetic data applied to thesegments of the reference frame and then subtracting out the imageportions or pixel values represented by the model data, if used.Alternatively, the residue frame could be generated by subtracting therough frame from the current frame.

[0083] This residue frame is compressed (S12), and if the compression isnot lossless (S13), the resulting compressed residue frame isdecompressed (S14) for use in later steps. If the compression islossless, the compressed residue frame does not need to be decompressed,as the uncompressed residue frame could be used in the later steps. Insome cases, these steps could be omitted regardless of how thecompression is done, but preferably the later steps wherein the residueframe is used to generate the reference frame used for latercompressions would use the residue frame as it would exist at thedecoder, even if that is not exactly what the encoder started with.

[0084] Once all of that is done, the encoder can output the compressedcurrent frame as a compressed nonkey frame comprising the set of kineticinformation, model data (if used) and a compressed residue frame (S 15).Then, the encoder determines whether the next frame will be a key frame(S16). This decision could be made based on some external trigger, adetermination that the current frame is from a different scene than thereference frame (scene change detect), or based on the results ofcompressing the current frame. Although not shown in the figure, theprocess might include further logic to discard the compressed nonkeyframe generated for the current frame if the compression is not goodenough and repeat the process with the current frame being treated as akey frame.

[0085] If the next frame is a nonkey frame, the current frame islabelled as the reference frame (possibly moved into a frame bufferallocated for the reference frame). Where the compression is notlossless, preferably the decompressed current frame is used as thereference frame instead of the original uncompressed current frame, sothat the encoder and the decoder are in sync. The process thencontinues, looping back to step S5, where the new reference frame issegmented and another frame is received, to become the now currentframe. In some embodiments, the subsequent frame uses a frame other thanthe immediately prior current frame as its reference frame. In someembodiments, more than one prior encoded frame is used as the reference.

[0086] If the next frame is to be a key frame, the process loops back tostep S1 and repeats from there, with the next frame being the currentframe. The process can loop until there are no more frames to encode. Itshould be understood that the encoder might also perform steps such asadding header information, such as at the beginning of a sequence or theend of a sequence.

[0087] Referring now to FIG. 9, a flowchart of a decoding process isthere shown. The process begins with receiving a compressed frame (stepS30). The decoder then determines if the received frame is a key frame(S31), such as by inspecting a “keyframe” flag in the input data.Alternatively, the decoder can guess from the prior decoded data usingrules known the encoder.

[0088] If it is a key frame, it is decompressed (S32), output (S33) andstored as a reference frame. If the decoder can determine that thecurrent frame will not be used as a reference frame, then it need not bestored as the reference frame. In some implementations, the frame doesnot have to be stored and its current location is just labelled as thelocation of the reference frame. In other implementations, the frame ismoved into storage specifically for reference frames. The process thenloops back to step S30 awaiting another frame.

[0089] If the received frame is not a key frame, the decoder receiveskinetic information (S35). If the encoded stream includes them, thedecoder receive an indication of which of a plurality of segmentationswas used by encoder, segmentation hints, partial segmentationinformation, canonical information or the like. From the receivedinformation, a first rough frame is generated (S36). One way togenerated the first rough frame is to start with a blank frame andpopulate it with pixel values from segments of the reference frame,adjusting the segments as indicated by the kinetic information and otherreceived information.

[0090] Next, the model data is received (S37) and a second rough frameis generated (S38) by modifying the first rough frame according to themodel data. Alternatively, the model data might have been receivedbefore step S36. The decoder might combine the steps of generating thefirst and second rough frames into one step of frame generation. Themodel data, if used, might include results of exposed area processing,general image parameterization or application of non-motion relatedkinetic information.

[0091] Next, the compressed residue frame is received (S39) and areconstructed nonkey frame is generated (S40) by modifying the secondrough frame according to the residue data. As with the above steps, theordering of the receipt and generation might be different than thisexample describes.

[0092] Once the nonkey frame is generated, it can be output (S41). Ifthat frame is to be used as a reference frame for other nonkey frames,it is stored as the reference frame and segmented (S42) and the processloops back to step S30 to receive the next frame until all the framesare received.

[0093] Specific Implementations

[0094] The examples described above can be further particularizeddepending on needs of the application or known characteristics of theimages. This section describes various optional implementation detailsthat might be used to improve upon the above-described systems forparticular needs or purposes.

[0095] Partial Synchronization

[0096] In the examples above, it is generally assumed that the encoderand the decoder are in sync. For example, where the encoder needs tomake a coding decision, the encoder bases the decision on the version ofthe video sequence that the decoder has, not what the encoder has, ifthose two differ. In a partial synchronization system, the encoder mightsometimes use information that is not available to the decoder and thedecoder would make a best guess. This is most useful where the effectsof a wrong guess at the decoder are not expected to be significant andthere are great gains to be made in computing effort or compressionratios if complete synchronization is not enforced.

[0097] Hints

[0098] Where the encoder determines that the errors between an originalframe and the decompressed version of the compressed original frame, dueto the compression not being lossless, and that the errors wouldintroduce undesirable artifacts, the encoder can include hints usable bythe decoder to reduce those errors. In a simple example, the encoderlosslessly encodes the error (which might require more bits overall thanif the original frame were losslessly compressed). In a more likelyexample, the encoder might determine which of the differences causesignificant segmentation differences and hint to correct for thosesegmentation differences. Such hints might allow the decoder toreconstruct (and thus use) a segmentation of the original frame ratherthan the reconstructed frame.

[0099] The hints might also be usable by the decoder to partially orfully synchronize the decoder to the encoder segmentation or to theencoder canonicalization.

[0100] Metadata

[0101] Other information included in the compressed video data might bemetadata associated with segments. Since the segments are oftenassociated with objects in a scene, the metadata could be used forpoint-and-click operations. For example, the video stream might includereferences to areas of the input frame that are associated withmetadata. The encoder's segmenter can then associate that metadata withspecific segments. Those associations can be provided to the decoder,for use by the video user. For example, areas of the image could beassociated with URLs linking the area to a resource on the Internet.Those associations would be carried with the image as the video sequenceis presented to the video user.

[0102] Metadata is associated with segments and can remain with segmentsfrom frame to frame as the segment evolves. For example, a segment'ssegment index may change due to changes in position or othercanonicalization process, but the metadata will remain associated withthat segment (i.e., inherited from prior frame's segments). Metadata canbe associated with a group of segments and if a segment breaks up, thenew multiple segments will all inherit the prior frame segment'smetadata.

[0103] Hierarchy of Segmentation

[0104] Where a frame is an image of a scene containing objects largerthan a pixel extent, the segmentation of the frame might tend to followbounds of the objects. In the simplified example of FIG. 7, where theobjects are a truck with windows and tires, and a sun and a road, thesegmentation follows the bounds of the objects in the scene.

[0105] As might be apparent from FIG. 7, if the kinetic information foreach segment is encoded separately, some redundancy will occur, as thedisplacements of the truck, the tires and the windows will typically bethe same or very similar. Reducing this redundancy would result in asmaller compressed size for the compressed video data. One way to reducethis redundancy is to establish a hierarchy of segmentation.

[0106] Using FIG. 7 as an example, the truck, tires and windows might begrouped into one higher level segment comprising several (five, in thiscase) segments at a lower level in the segment hierarchy. When codingsegment information such as translation, the high level segmenttranslation could be given, along with relative translations of thelower level segments relative to the “group” translation. This mightalso apply to other kinetic information, such as lighting changes.

[0107] Segmentation can be either bottom-up or top-down. With bottom-upsegmentation, an image is segmented based on image content intofirst-level segments (small segments) and those first-level segments aregrouped into second-level segments based on first-level segment content(i.e., pixel color values of pixels in the first-level segments,relative motion, etc.). The process is then continued to findthird-level segments up to N-level segments, if more than two levels ofthe hierarchy are used.

[0108] With top-down segmentation, an image is segmented based on imagecontent into first-level segments (large segments) and those first-levelsegments are segmented into one or more second-level segments based onfirst-level segment content and the process is then continued to findthird-level segments down to N-level segments, if more than two levelsof the hierarchy are used.

[0109] For a bottom-up segment hierarchy, the generation of second-levelsegments might consider the boundaries of the first-level segments aswell as pixel values in the first-level segments.

[0110] A degenerate hierarchy (i.e., a one-level hierarchy) might resultfrom either of these hierarchy approaches. Preferably, the segments thatare grouped into a group of segments are “simply connected” together.

[0111] An encoder can send the segment hierarchy to a decoder for use indecoding the frame, but in some embodiments, the encoder and decoder arein sync, so the decoder can generate a segment hierarchy from alreadydecoded frames for use in decoding a current frame.

[0112] The segment hierarchy might be useful in editing or formattingone or more frames, wherein edits or formats are applied at varyinglevels of groupings of segments. The segment hierarchy is likely to beuseful for compressing the video data and/or associating metadata withelements of the frame, since the hierarchy of the segments might followthe hierarchy of objects in the scene. For example, for a scene of afootball game, higher-level segments might envelop a player and afootball, while lower-level segments envelop various areas of theplayer's jersey and helmet, the laces of the football, etc.

[0113] Motion Vector Grouping/Kinetic Data Elements Grouping

[0114] Instead of sending encoding each motion vector and each otherkinetic data element separately, motion vectors (for example) might begrouped in various levels of hierarchy. The groupings can be done asdescribed herein for segment groupings, or the motion vectors can begrouped independently of any segment grouping.

[0115] When a set of motion vectors is encoded as a group, the encodingincludes a group motion vector and residual motion vectors indicatingchanges of each member relative to their group motion vector. This canalso be done for other kinetic data elements, such as lighting changes.

[0116] The grouping of a current set of motion vectors can be done bylooking at a prior set of motion vectors and/or by looking at thecontent of the reference image, such as its segmentation. The referenceimage is the image to which the motion vectors relate, such that themotion vectors represent kinetic differences between the reference imageand the current image.

[0117] In some embodiments, the ordering of segments and the encoder anddecoder need not be consistent and the grouping is done by consideringthe values for the prior set of motion vectors or the segments of thereference image and group based on their values instead of any index.The indication of the grouping by value can also be partial, where theencoder conveys part of the grouping and the decoder determines therest.

[0118] In some embodiments, there is a distinction between the casewhere there is no prior history and where there is prior history. In theformer case, the encoder encodes and the decoder decodes using groupingsof motion vectors that are determinable from the contents or segments ofthe reference frame, while in the latter case the encoder can encode andthe decoder can decode using groupings of motion vectors that are basedon previously occurring motion vectors and/or previous groupings ofmotion vectors.

[0119] The reference frame can be a key frame or a previouslycoded/decoded nonkey frame. In a video sequence, the current frame neednot occur before or after the reference frame. The decoder assumes themotion vector data comes in groups and the decoder knows the hierarchyof segments. Thus, the encoded stream can be first level resolution ofmotion vectors, followed by residues as the next level, etc.

[0120] Synchronous Temporal Predicting of Motion Vectors at Encoder andDecoder

[0121] If the motion vectors (and other kinetic information) are encodedwithout reference to predictable changes, further compression might bepossible by omitting predictable changes, e.g., by only encoding thedifference between a predicted change and an actual change. For example,if a segment is moving from frame to frame in a linear direction, aprediction would be that the motion vector for subsequent frames wouldindicate continued movement in that linear direction. Thus, where theencoder and the decoder are both performing the prediction, the encoderneed only encode any variance from that linear motion as opposed toencoding the entire motion. The prediction can use a hierarchy ofsegments and/or a hierarchy of motion vectors, possibly resulting in ahierarchy of predictions.

[0122] One type of prediction is to examine the motion of segments in afirst frame and a second frame and predict that inertia will apply tomovements of the segments in a third frame. Another type of predictionis that if the light is fading linearly (or in a nonlinear, butpredictable way), the kinetic information about lighting is predicted.

[0123] In one variation, motion vectors are grouped and the group motionvectors are predicted while the residual relative motion vectors or eachmember of the group are encoded as the difference between the predictedgroup motion and the actual individual member motion, regardless of whatthe actual group motion is, thus encoding the correction to theprediction and the refinement of individual member movement.

[0124] Exposed Area Filling Performed by Encoder and Decoder

[0125] Where motion vector coding is used to encode a nonkey frame,exposed areas might be present in the resulting intermediateconstruction of the nonkey frame following application of motion vectorsand other kinetic information. The intermediate construction, or “rough”frame” is the frame generated, or generatable, from just a referenceframe and a set of motion vectors describing the position changes ofblocks or segments between the reference frame and the “current” framebeing encoded or decoded. If all of the segments in the reference framefind matches in the current frame and none of the segments moved, thenof course there would be no gaps in the content of the current frame.However, if there is motion at all from frame to frame, there are likelyto be areas of the current frame that are “exposed” areas. Without moreunderstanding of the objects in the scene being captured by the imagesformed by the frames being encoded, the pixel color values for pixels inexposed areas of the current frame cannot be deduced from the referenceframe, because whatever object or object portion that is represented bythe exposed area was not present in the reference frame.

[0126] With understanding of the objects in the scene, however, theencoder and decoder can infer what the newly exposed area looks like.For example, if it is apparent that the scene is a round ball passingover a checkerboard pattern, the encoder can infer that any areas thatwere obscured by the ball in the reference frame but are exposed in thecurrent frame can be described by a continuation of the checkerboardpattern. This information can be used by the decoder to decode exposedareas without information from the encoder and the encoder can use thisinformation to determine what to omit from the encoded video datastream. In some cases, such as were the encoder estimates what theexposed area looks like and the estimate matches what is actually therein the current frame, the encoded video data need not include anyfurther information about the exposed area and the decoder will stillcorrectly construct the exposed area in the current frame.

[0127] The exposed area filling process described herein can be used ina segment-based system where the current frame is roughly encoded byreference to segments of a reference frame and motion vectors associatedwith those reference frame segments, but can also be used in ablock-based system where the current frame is roughly encoded byreference to blocks of a reference frame and motion vectors associatedwith those reference frame blocks. One difference between asegment-based system and a block-based system is the a segment-basedsystem uses frames divided up based on frame pixel color values, whereasa block-based system typically divides up a frame in a fixed mannerregardless of content, such as dividing up each frame into 8 pixel by 8pixel macroblocks.

[0128] Typically, in a block-based system, the blocks are matched andmotion vectors generated and the leftover areas of the current frame(the exposed areas) are encoded as part of the residue. This can beinefficient, if the residue contains bits of information that thedecoder can infer by itself from what information the decoder alreadyhas.

[0129] In a typical segment-based process, a key frame is received,compressed and used as a reference frame. If the compression is notlossless, the compressed frame is decompressed and used instead of theoriginal. The frame is then segmented.

[0130] When a nonkey frame is received, it is processed with referenceto the segmentation and content of the reference frame. Thus, segmentsare matched between the segmentation of the reference frame and thecontent of the current frame. The kinetic information describing changesin the segments from frame to frame is then generated. From this, afirst approximation to the nonkey frame is generated or exists.

[0131] The pixels of the current frame that are not associated withsegments from the reference frame are considered exposed areas. Theseexposed area pixels can be assigned to new segments, as appropriate.Each of the new segments is then processed to determine how to code thepixels from the current frame that fall into these new segments.Examples are described below.

[0132] For decoding, the decoder can generate the first approximationfrom the reference frame and the motion vectors. It then applies theencoding of the exposed areas, as provided by the encoder, to fill inthe rest of the frame. In some cases, the exposed area fillinginformation leaves nothing to be included as residue, but in othercases, the result of applying the exposed area filling is a secondapproximation of the current frame that is then processed according tothe residue data.

[0133] One method of exposed area filling examines the pixel colorvalues of adjacent segments and continues the color values or patternsof adjacent segments with higher z-order values than other adjacentsegments. This would be an accurate reconstruction of an exposed areawhere one object in the scene is partially obscuring another object inthe scene. The obscured object would have a higher z-order, because itis further from the point of view of the frame and thus it would be agood estimate to assume that when the closer object moves to expose anexposed area, the exposed area is actually part of the obscured object.If that doesn't happen to be the case, then the difference can be codedas exposed area filling, or it can be ignored and be included as part ofthe residue.

[0134] Note that the encoder and decoder can both perform the exposedarea filling process, so that the encoder does not need to encode theresults of the process, other than the variance between the currentframe and the results of the process. In cases where one of a pluralityof fill schemes is used, the encoder can encode its selection, unlessthe decoder can infer correctly the scheme used.

[0135] Exposed area fill information might include bounds of areas to befilled, and/or pixel values of pixels in areas to be filled. Partialfill information or fill hints might be included in the encoded videodata and the exposed area filling process need not be exact, ifdifferences in the filling done by the decoder and encoder areacceptable. In some implementations, the exposed area filling is doneentirely at the encoder and conveyed to decoder, in which case, decoderprocessing is not required.

[0136] Residue Coding Performed Using Basis Functions by Encoder andDecoder

[0137] In some of the examples described above, after various codingsteps are performed, the remaining residue between the current frame andwhat has been coded is then just coded as a difference frame usingconventional methods. For example, since it is expected that mostresidue frames would be sparsely populated, it can be quickly compressedusing run-length encoding. However, in some cases, compression of theresidue frame can be improved by coding the residue using basisfunctions. Thus, the encoded residue would comprise coefficients ofbasis functions known to the encoder and the decoder. Basis functionencoding of a residue frame could be done where the residue is left overafter a segment-based coding, or left over after other types of coding.

What is claimed is:
 1. An encoding system, wherein an encoder encodes uncompressed video data to form compressed video data and a decoder decodes the compressed video data to form at least an approximation of the uncompressed video data, and wherein the video data comprises a sequence of a plurality of image frames comprising key frames and nonkey frames, the encoding system comprising: an encoder comprising: a) a segmenter that generates a segmentation of a reference frame, wherein a reference frame is a frame having content that is used in encoding a nonkey frame and wherein the segmentation is an assignment of some or all of the pixels of the reference frame to segments based on at least one of pixel color values of the pixels and location of the pixels in the reference frame; b) a kinetic information generator that generates kinetic information that relates regions of a nonkey frame to segments of the reference frame as indicated by the segmentation generated by the segmenter; c) an exposed area fill processor that determines how to fill exposed areas in the nonkey frame that are not associated with segments of the reference frame according to a predetermined exposed area fill process; and c) a compressed video data outputter that outputs compressed video data including at least compressed key frames, the kinetic information and residue data representing differences between content of the nonkey frame and a frame resulting from an application of the kinetic information, segmentation and exposed area fill results; and a decoder comprising: a) a nonkey frame generator that regenerates a nonkey frame using kinetic information about the nonkey frame from the compressed video data and the segmentation of the reference frame; b) an exposed area fill processor that determines how to fill exposed areas in the nonkey frame that are not associated with segments of the reference frame according to the predetermined exposed area fill process; and c) a residue processor that corrects for differences in a generated frame and a reconstructed nonkey frame, where the generated frame is generated from the segmentation, the reference frame content and the kinetic information and altered based on results of the exposed area fill processor.
 2. The encoding system of claim 1, wherein the encoder includes in the compressed video data, and the decoder uses, an indication of which of a plurality of fill schemes is used.
 3. The encoding system of claim 1, wherein the decoder includes logic to deduce which of a plurality of fill schemes was used for a given reference frame from other data extracted from the compressed video data.
 4. The encoding system of claim 3, wherein the decoder and encoder select the same fill scheme and the selection of fill scheme is based on image content.
 5. The encoding system of claim 3, wherein the decoder and encoder select the same fill scheme and the selection of fill scheme is based on image content and on hints provided by the encoder in the compressed video data as to which selection the encoder made.
 6. The encoding system of claim 1, wherein the exposed area fill includes bounds of areas to be filled.
 7. The encoding system of claim 1, wherein the exposed area fill includes pixel values of pixels in areas to be filled.
 8. The encoding system of claim 1, wherein the exposed area fill done by the encoder for a given reference frame and nonkey frame is exactly the same as the exposed area fill done by the decoder for those given frames.
 9. The encoding system of claim 1, wherein the compressed video data encodes at least one reference frame such that the encoding of the frame is lossy and wherein the exposed area fill done by the encoder is of a reconstruction of the compressed version of the reference frame in place of the original reference frame.
 10. The encoding system of claim 1, wherein the compressed video data encodes at least one reference frame losslessly and wherein the exposed area fill done by the encoder is of the original reference frame.
 11. The encoding system of claim 1, wherein the compressed video data includes partial fill information.
 12. The encoding system of claim 1, wherein the compressed video data includes fill hints.
 13. The encoding system of claim 1, wherein the compressed video data includes representations of results of the exposed area fill processor of the encoder.
 14. An encoder for encoding uncompressed video data to form compressed video data, wherein the video data comprises a sequence of a plurality of image frames comprising key frames and nonkey frames, the encoder comprising: a segmenter that generates a segmentation of a reference frame, wherein a reference frame is a frame having content that is used in encoding a nonkey frame and wherein the segmentation is an assignment of some or all of the pixels of the reference frame to segments based on at least one of pixel color values of the pixels and location of the pixels in the reference frame; a kinetic information generator that generates kinetic information that relates regions of a nonkey frame to segments of the reference frame as indicated by the segmentation generated by the segmenter; an exposed area fill processor that determines an encoder-exposed area fill information for filling exposed areas in the nonkey frame that are not associated with segments of the reference frame according to a predetermined exposed area fill process; and a compressed video data outputter that outputs compressed video data including at least compressed key frames, the kinetic information and residue data representing differences between content of the nonkey frame and a frame resulting from an application of the kinetic information, segmentation and exposed area fill results.
 15. The encoder of claim 14, wherein the encoder is adapted to generate difference frame information based on the encoder-exposed area fill information such that the difference frame information is decodable by a decoder to generate decoder-exposed area fill information that is the same or similar to the encoder-exposed area fill information.
 16. The encoder of claim 14, wherein the encoder is adapted to use the segmentation to generate the encoder-exposed area fill information.
 17. The encoder of claim 14, wherein encoder-exposed area fill information includes bounds of areas to be filled.
 18. The encoder of claim 14, wherein encoder-exposed area fill information includes pixel values of pixels in areas to be filled.
 19. The encoder of claim 14, wherein the encoder includes in the compressed video data an indication of which of a plurality of fill schemes is used.
 20. The encoder of claim 14, wherein the encoder-exposed area fill information includes bounds of areas to be filled.
 21. The encoder of claim 14, wherein the encoder-exposed area fill information includes pixel values of pixels in areas to be filled.
 22. The encoder of claim 14, wherein the encoder-exposed area fill information for a given reference frame and nonkey frame can be replicated by a decoder from previously decoded information.
 23. The encoder of claim 14, wherein the compressed video data encodes at least one reference frame such that the encoding of the frame is lossy and wherein the exposed area fill done by the encoder is of a reconstruction of the compressed version of the reference frame in place of the original reference frame.
 24. The encoder of claim 14, wherein the compressed video data encodes at least one reference frame losslessly and wherein the exposed area fill done by the encoder is of the original reference frame.
 25. The encoder of claim 14, wherein the compressed video data includes partial fill information.
 26. The encoder of claim 14, wherein the compressed video data includes fill hints.
 27. A decoder for decoding video data from compressed video data, wherein the video data comprises a sequence of a plurality of image frames comprising key frames and nonkey frames, the decoder comprising: a nonkey frame generator that regenerates a nonkey frame using kinetic information about the nonkey frame from the compressed video data and the segmentation of the reference frame; an exposed area fill processor that determines an exposed area fill information for filling exposed areas in the nonkey frame that are not associated with segments of the reference frame according to the predetermined exposed area fill process; and a residue processor that corrects for differences in a generated frame and a reconstructed nonkey frame, where the generated frame is generated from the segmentation, the reference frame content and the kinetic information and altered based on results of the exposed area fill processor.
 28. The decoder of claim 27, wherein the decoder is adapted to generate difference frame information based on the exposed area fill information.
 29. The decoder of claim 27, wherein the decoder is adapted to generate a segmentation and use the generated segmentation to generate exposed area fill information.
 30. The decoder of claim 27, wherein the decoder is adapted to extract a segmentation from the compressed video data and uses the extracted segmentation to generate exposed area fill information.
 31. The decoder of claim 27, wherein exposed area fill information includes bounds of areas to be filled.
 32. The decoder of claim 27, wherein exposed area fill information includes pixel values of pixels in areas to be filled.
 33. The decoder of claim 27, wherein the decoder is adapted to extract from the compressed video data an indication of which of a plurality of fill schemes is used.
 34. The decoder of claim 27, wherein the exposed area fill includes bounds of areas to be filled.
 35. The decoder of claim 27, wherein the exposed area fill includes pixel values of pixels in areas to be filled.
 36. The decoder of claim 27, wherein the decoder is adapted to extract from the compressed video data results of an exposed area fill process performed by an encoder. 